منابع مشابه
Counting Trees
Let t n denote the number of unlabeled trees on n vertices. Let t(x) = P 1 n=1 t n x n be the corresponding generating function. Similarly, let T n , h n , and i n denote the numbers of rooted trees, homeomorphically irreducible trees, and identity trees on n vertices, respectively. (Homeomorphically irre-ducible trees have no vertices of degree 2, and identity trees have trivial au-tomorphism ...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملCounting Spanning Trees∗
This book provides a comprehensive introduction to the modern study of spanning trees. A spanning tree for a graph G is a subgraph of G that is a tree and contains all the vertices of G. There are many situations in which good spanning trees must be found. Whenever one wants to find a simple, cheap, yet efficient way to connect a set of terminals, be they computers, telephones, factories, or ci...
متن کاملCounting Rooted Trees 3
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C · ρ−n · n−3/...
متن کاملCounting unlabeled k-trees
We count unlabeled k-trees by properly coloring them in k + 1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1974
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500002317